An optimal parallel algorithm for digital curve segmentation
نویسندگان
چکیده
منابع مشابه
An elementary algorithm for digital arc segmentation
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملAn Optimal Parallel Algorithm for Formula Evaluation
A new approach to Buss’s NC algorithm [Bus87] for evaluation of Boolean formulas is presented. This problem is shown to be complete for NC over AC reductions. This approach is then used to solve the more general problem of evaluating arithmetic formulas using arithmetic circuits.
متن کاملAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کاملAn optimal parallel matching algorithm for cographs
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...
متن کاملAn Optimal Parallel Algorithm for Learning
Sequential algorithms given by Angluin (1987) and Schapire (1992) learn deterministic nite automata (DFA) exactly from Membership and Equivalence queries. These algorithms are feasible, in the sense that they take time polynomial in n and m, where n is the number of states of the automaton and m is the length of the longest counterexample to an Equivalence query. This paper studies whether para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00227-7